Improving the Efficiency of Parsing with Discontinuous Constituents
نویسندگان
چکیده
We discuss a generalization of Earley’s algorithm to grammars licensing discontinuous constituents of the kind proposed by the socalled linearization approaches in Head-Driven Phrase Structure Grammar. We show how to replace the standard indexing on the string position by bitmasks that act as constraints over possible coverage bitvectors. This improves efficiency of edge access and reduces the number of edges by constraining prediction to those grammar rules which are compatible with known word order properties. The resulting parsing algorithm does not have to process the righthand side categories in the order in which they cover the string, and so a head-driven strategy can be obtained simply by reordering the righthand side categories of the rules. The resulting strategy generalizes head-driven parsing in that it also permits the ordering of non-head categories.
منابع مشابه
Improving the Efficiency of Parsing Discontinuous Constituents
A prominent tradition within the framework of Head-Driven Phrase Structure Grammar (HPSG, Pollard and Sag 1994) has argued on linguistic grounds for analyses which license so-called discontinuous constituents (Reape 1993; Kathol 1995; Richter and Sailer 2001; Müller 1999a; Penn 1999; Donohue and Sag 1999; Bonami et al. 1999), joining researchers in other linguistic frameworks, including Depende...
متن کاملParsing with Discontinuous Constituents
By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.
متن کاملParsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like anbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constitu...
متن کاملDiscontinuous Incremental Shift-reduce Parsing
We present an extension to incremental shift-reduce parsing that handles discontinuous constituents, using a linear classifier and beam search. We achieve very high parsing speeds (up to 640 sent./sec.) and accurate results (up to 79.52 F1 on TiGer).
متن کاملContinuous or Discontinuous Constituents?
Reape (1991) notes that it is possible to develop grammars based on the concept of discontinuous constituents which span every subset of an input string. The complexity of the paring problem for such grammars is at least exponential in both time and space. As Reape (1991, p. 62) has argued for the processing of grammars with discontinuous constituents and as Carroll (1994) has demonstrated for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002